R-norm entropy and R-norm divergence in product MV-algebras
نویسندگان
چکیده
منابع مشابه
Some More Noiseless Coding Theorem on Generalized R-Norm Entropy
A parametric mean length is defined as the quantity L R = R R−1 [ 1 − ∑N i=1 p β i D −ni( R−1 R ) ∑N j=1 p β j ] where R > 0 ( 1) , β > 0, pi > 0, ∑ pi = 1, i = 1, 2, . . . ,N. This being the mean length of code words. Lower and upper bounds for L R are derived in terms of R-norm information measure for the incomplete power distribution. AMS Subject classification. 94A15, 94A17, 94A24, 26D15.
متن کاملA Coding Theorem Connected on R-Norm Entropy
A relation between Shannon entropy and Kerridge inaccuracy, which is known as Shannon inequality, is well known in information theory. In this communication, first we generalized Shannon inequality and then given its application in coding theory.
متن کاملLogical Divergence, Logical Entropy, and Logical Mutual Information in Product MV-Algebras
In the paper we propose, using the logical entropy function, a new kind of entropy in product MV-algebras, namely the logical entropy and its conditional version. Fundamental characteristics of these quantities have been shown and subsequently, the results regarding the logical entropy have been used to define the logical mutual information of experiments in the studied case. In addition, we de...
متن کاملBoolean algebras R-generated by MV-effect algebras
We prove that every MV-effect algebra M is, as an effect algebra, a homomorphic image of its R-generated Boolean algebra. We characterize central elements of M in terms of the constructed homomorphism. 1. Definitions and basic relationships An effect algebra is a partial algebra (E;⊕, 0, 1) with a binary partial operation ⊕ and two nullary operations 0, 1 satisfying the following conditions. (E...
متن کاملSome properties of Diametric norm and its isometries on B_0 (Bbb R)$
This article has no abstract.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Soft Computing
سال: 2018
ISSN: 1432-7643,1433-7479
DOI: 10.1007/s00500-018-03695-5